Complexity dips in random infinite binary sequences
نویسندگان
چکیده
منابع مشابه
Random Binary Sequences in Telecommunications
Realization of modern telecommunication systems is inconceivable without use of different binary sequences. In this paper, an overview of random binary sequences used in different telecommunication systems is given. Basic principles of pseudorandom, chaotic, and true random sequence generation are presented, as well as their application in telecommunications in respect to advantages and drawbac...
متن کاملBinary Random Sequences Obtained From Decimal Sequences
D sequences [1-15] are perhaps the simplest family of random sequences that subsumes other families such as shift register sequences [16]. In their ordinary form, d sequences are not computationally complex [2], but they can be used in a recursive form [8] that is much stronger from a complexity point of view. The basic method of the generating the binary d-sequences is given in [1]. The autoco...
متن کاملAutocorrelations of Random Binary Sequences
We define Bn to be the set of n-tuples of the form (a0, . . . , an−1) where aj = ±1. If A ∈ Bn, then we call A a binary sequence and define the autocorrelations of A by ck := ∑n−k−1 j=0 ajaj+k for 0 k n− 1. The problem of finding binary sequences with autocorrelations ‘near zero’ has arisen in communications engineering and is also relevant to conjectures of Littlewood and Erdős on ‘flat’ polyn...
متن کاملCorrelations of Random Binary Sequences
Strong correlations between output distribution means of a variety of random binary processes and prestated intentions of some 100 individual human operators have been established over a 12-year experimental program. More than 1000 experimental series, employing four different categories of random devices and several distinctive protocols, show comparable magnitudes of anomalous mean shifts fro...
متن کاملComplexity of infinite sequences with zero entropy
The complexity function of an infinite word w on a finite alphabet A is the sequence counting, for each nonnegative n, the number of words of lenght n on the alphabet A that are factors of the infinite word w. The goal of this work is to estimate the number of words of lenght n on the alphabet A that are factors of an infinite word w with a complexity function bounded by a given function f with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1978
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(78)90062-1